Large-Scale Optimization for Evaluation Functions with Minimax Search
نویسندگان
چکیده
منابع مشابه
Large-Scale Optimization for Evaluation Functions with Minimax Search
This paper presents a new method, Minimax Tree Optimization (MMTO), to learn a heuristic evaluation function of a practical alpha-beta search program. The evaluation function may be a linear or non-linear combination of weighted features, and the weights are the parameters to be optimized. To control the search results so that the move decisions agree with the game records of human experts, a w...
متن کاملOPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING MODIFIED CHARGED SYSTEM SEARCH
Optimal design of large-scale structures is a rather difficult task and the computational efficiency of the currently available methods needs to be improved. In view of this, the paper presents a modified Charged System Search (CSS) algorithm. The new methodology is based on the combination of CSS and Particle Swarm Optimizer. In addition, in order to improve optimization search, the sequence o...
متن کاملA Line Search Multigrid Method for Large-Scale Nonlinear Optimization
Abstract. We present a line search multigrid method for solving discretized versions of general unconstrained infinite dimensional optimization problems. At each iteration on each level, the algorithm computes either a “direct search” direction on the current level or a “recursive search” direction from coarser level models. Introducing a new condition that must be satisfied by a backtracking l...
متن کاملA Line Search Multigrid Method for Large-scale Convex Optimization
Abstract. We present a line search multigrid method based on Nash’s MG/OPT multilevel optimization approach for solving discretized versions of convex infinite dimensional optimization problems. Global convergence is proved under fairly minimal requirements on the minimization method used at all grid levels. In particular, our convergence proof does not require that these minimization, or so-ca...
متن کاملA Unified Search Framework for Large-scale Black-box Optimization
The parameter configuration of a network protocol can be formulated as a black-box optimization problem with network simulation evaluating the performance of the blackbox, i.e., the network. This paper proposes a unified search framework (USF) to handle such large-scale black-box optimization problems. The framework is designed to provides a general platform on which tailored optimization algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2014
ISSN: 1076-9757
DOI: 10.1613/jair.4217